Cyclic convolution algorithms over finite fields: Multidimensional considerations
نویسندگان
چکیده
Meghanad D. Wagh * By making an example of the earlier proposed cyclic convolution algorithms, the computational efficiency of the multidimensional techniques over finite fields is investigated. It is shown that the multidimensional techniques are inferior to the directly designed algorithms for all lengths except when applied to lengths whose exponents are relatively prime. Relations between the complexities of the directly designed algorithms and those derived through the multidimensional techniques are also established in various cases.
منابع مشابه
Cyclotomic FFT of Length 2047 Based on a Novel 11-point Cyclic Convolution
Discrete Fourier transforms (DFTs) over finite fields have widespread applications in error correction coding [1]. For Reed-Solomon (RS) codes, all syndrome-based bounded distance decoding methods involve DFTs over finite fields [1]: syndrome computation and the Chien search are both evaluations of polynomials and hence can be viewed as DFTs; inverse DFTs are used to recover transmitted codewor...
متن کاملEvaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms
Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...
متن کاملMultidimensional Multichannel FIR Deconvolution Using GrÖbner Bases
We present a new method for general multidimensional multichannel deconvolution with finite impulse response (FIR) convolution and deconvolution filters using Gröbner bases. Previous work formulates the problem of multichannel FIR deconvolution as the construction of a left inverse of the convolution matrix, which is solved by numerical linear algebra. However, this approach requires the prior ...
متن کاملOn Symmetric Algorithms for Bilinear Forms over Finite Fields
In this paper we study the computation of symmetric systems of bilinear forms over finite fields via symmetric bilinear algorithms. We show that, in general, the symmetric complexity of a system is upper bounded by a constant multiple of the bilinear complexity; we characterize symmetric algorithms in terms of the cosets of a specific cyclic code, and we show that the problem of finding an opti...
متن کاملHartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming distance is gained, and it is possible to design efficient decoding algorithms. In this paper, we give a version of the Hartmann-Tzeng bound that works for a wide ...
متن کامل